Uniformity is Weaker than Semi-Uniformity for Some Membrane Systems
نویسندگان
چکیده
منابع مشابه
Uniformity is Weaker than Semi-Uniformity for Some Membrane Systems
We investigate computing models that are presented as families of finite computing devices with a uniformity condition on the entire family. Examples of such models include Boolean circuits, membrane systems, DNA computers, chemical reaction networks and tile assembly systems, and there are many others. However, in such models there are actually two distinct kinds of uniformity condition. The f...
متن کاملThe Computational Complexity of Uniformity and Semi-uniformity in Membrane Systems
We investigate computing models that are presented as families of finite computing devices with a uniformity condition on the entire family. Examples include circuits, membrane systems, DNA computers, cellular automata, tile assembly systems, and so on. However, in this list there are actually two distinct kinds of uniformity conditions. The first is the most common and well-understood, where e...
متن کاملNon-uniformity - Some Background
The conditional result we saw last time does much more than that. If we have a language in the uniform class E not in the non-uniform class SIZE(s(n)) then a PRG exists. I.e., there is a way to systematically replace random bits with pseudorandom bits such that no BPP algorithm will (substantially) notice the difference. Thus, not only it shows that all languages in BPP are in fact in P (or wha...
متن کاملLowen uniformity via fuzzifying uniformity
The original definition of a topological space given by Hausdorff used neighborhood systems. Lattice-valued maps appear in this context when you identify a topology with a monoid in the Kleisli category of the filter monad on SET. H?hle’s notion of a lattice-valued topology [2] uses the same idea and it’s inspired in the classical lattice-valued topologies. Ltopological spaces are motivated by ...
متن کاملA circuit uniformity sharper than DLogTime
We consider a new notion of circuit uniformity based on the concept of rational relations, called Rational-uniformity and denoted Rat. Our goal is to prove it is sharper than DLogTime-uniformity, the notion introduced by Barrington et al. [3], denoted DLT , that is: 1) Rational-uniformity implies DLogTime-uniformity, 2) we have NCRat NCDLT ( NCRat, 3) we have ∀k > 0, NCDLT ⊆ NC Rat , 4) Rationa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Informaticae
سال: 2014
ISSN: 0169-2968
DOI: 10.3233/fi-2014-1095